Flows with Ratner’s property have discrete essential centralizer
نویسندگان
چکیده
منابع مشابه
On Ideals Which Have the Weakly Insertion of Factors Property
A one-sided ideal of a ring has the insertion of factors property (or simply, IFP) if implies r for . We say a one-sided ideal of has the weakly IFP if for each , implies , for some non-negative integer . We give some examples of ideals which have the weakly IFP but have not the IFP. Connections between ideals of which have the IFP and related ideals of some ring extensions a...
متن کاملHamiltonian Flows Associated with Discrete Maps
We call this sequence a dynamical system generated by f and denote by qj the value of q0 = q after j times of the map qj = f (q0). We encounter such systems in various occasion in mathematics, physics and in the nature. All of complex dynamical systems are examples in mathematics. Bäcklund transformations which characterize integrable systems, connection formulae of Stokes geometry E-mail: sait...
متن کاملOn the shadowing property of nonautonomous discrete systems
In this paper we study shadowing property for sequences of mappings on compact metric spaces, i.e. nonautonomous discrete dynamical systems. We investigate the relation of weak contractions with shadowing and h-shadowing property.
متن کاملGeneralized twisted centralizer codes
An important code of length n is obtained by taking centralizer of a square matrix over a finite field Fq. Twisted centralizer codes, twisted by an element a ∈ Fq, are also similar type of codes but different in nature. The main results were embedded on dimension and minimum distance. In this paper, we have defined a new family of twisted centralizer codes namely generalized twisted centralizer...
متن کاملTwisted Centralizer Codes
Given an n× n matrix A over a field F and a scalar a ∈ F , we consider the linear codes C(A, a) := {B ∈ F | AB = aBA} of length n2. We call C(A, a) a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when a = 1) is at most n, howe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2017
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm8660-11-2016